A Logical Process Calculus

This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, kPC extends Milner's Calculus of Conmmnicating Systems with operators fl'om the alternation free linear time p calculus (kT#). Semantically, kPC is equipped with a behavioral preorder that generalizes Hennessy's and DeNicola's must testing preorder as well as kTp's satisfaction relation, while being compositional for all kPC operators. From a technical point of view, the new calculus is distinguished by the inclusion of (i) both minimal and maximal fixed point operators and (ii) an unimplenlentability predicate on process terms, which tags inconsistent specifications. The utility of I_PC is demonstrated by means of an example highlighting the benefits of heterogeneous system specification. Key words, heterogeneous specification, must testing, process algebra, temporal logic, testing theory Subject classification. Computer Science